School of IT Technical Report MIDPOINT ROUTING ALGORITHMS FOR DELAUNAY TRIANGULATIONS

Oblivious online routing (OOR) algorithms are important for the applications with only local information available to make routing decisions. This paper gives two new OOR algorithms for a class of geometric graphs called Delaunay triangulations (DTs): the Midpoint Routing algorithm and the Compass Midpoint algorithm. Moreover, the former is generalized into a set of OOR algorithms that use the Euclidean distance as the reference and work for DTs, and the latter is generalized into a set of OOR algorithms that use the direction as the reference and work for DTs. Many other existing OOR algorithms can also be covered by these two sets. Finally, the two new algorithms are evaluated and compared with other existing OOR algorithms, and the experimental results give new findings on the performances of these algorithms in average and general cases. Keywords— geometric graph; Delaunay triangulations; oblivious online routing.